Fuzzy Relations and Metrics
نویسندگان
چکیده
منابع مشابه
Game Refinement Relations and Metrics
We consider two-player games played over finite state spaces for an infinite number of rounds. At each state, the players simultaneously choose moves; the moves determine a successor state. It is often advantageous for players to choose probability distributions over moves, rather than single moves. Given a goal (e.g., “reach a target state”), the question of winning is thus a probabilistic one...
متن کاملFUZZY SUBGROUPS AND CERTAIN EQUIVALENCE RELATIONS
In this paper, we study an equivalence relation on the set of fuzzysubgroups of an arbitrary group G and give four equivalent conditions each ofwhich characterizes this relation. We demonstrate that with this equivalencerelation each equivalence class constitutes a lattice under the ordering of fuzzy setinclusion. Moreover, we study the behavior of these equivalence classes under theaction of a...
متن کاملLogic and Fuzzy Relations
It is introduced an approach to the problem of "building logics" over sets of facts with only structured by a fuzzy relation of "consequence". Notions of "Truth" and "Falsehood" are introduced by means of two generalizations for classical Modus Ponens and Modus Tollens. Studying this concepts a theoretical base to explain the mode of reasoning in expert systems is obtained. By studying fuzzy tr...
متن کاملFuzzy Partial Order Relations and Fuzzy Lattices
We characterize a fuzzy partial order relation using its level set, find sufficient conditions for the image of a fuzzy partial order relation to be a fuzzy partial order relation, and find sufficient conditions for the inverse image of a fuzzy partial order relation to be a fuzzy partial order relation. Also we define a fuzzy lattice as fuzzy relations, characterize a fuzzy lattice using its l...
متن کاملRelations, Metrics and Applications of Stochastic Games
The last few decades have seen the emergence of formal methods for the modeling and analysis of hardware and software systems. The formal models of such systems are finite state automata, also known as labelled transition systems. A state of a system is a vertex in an automaton, labels represent inputs and labelled edges represent state transitions. Finite state automata may be deterministic, n...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Fuzzy Logic and Intelligent Systems
سال: 2009
ISSN: 1598-2645
DOI: 10.5391/ijfis.2009.9.1.030